Randomness vs Time: Derandomization under a Uniform Assumption
نویسندگان
چکیده
منابع مشابه
Randomness vs. Time: De-Randomization under a Uniform Assumption
We prove that $BPP ≠ EXP$, then every problem in $BPP$ can be solved deterministically in sub-exponential time on almost every input (on every samplable ensemble for infinitely many input sizes). This is the first derandomization result for $BPP$ based on uniform, noncryptographic hardness assumptions. It implies the following gap in the average-instance complexities of problems in $BPP$: eithe...
متن کاملLimitations of Hardness vs. Randomness under Uniform Reductions
We consider (uniform) reductions from computing a function f to the task of distinguishing the output of some pseudorandom generator G from uniform. Impagliazzo and Wigderson [IW] and Trevisan and Vadhan [TV] exhibited such reductions for every function f in PSPACE. Moreover, their reductions are “black box,” showing how to use any distinguisher T , given as oracle, in order to compute f (regar...
متن کاملUniform hardness vs. randomness tradeoffs for Arthur-Merlin games
Impagliazzo and Wigderson proved a uniform hardness vs. randomness ”gap result” for BPP. We show an analogous result for AM: Either ArthurMerlin protocols are very strong and everything in E = DTIME(2) can be proved to a sub-exponential time verifier, or else Arthur-Merlin protocols are weak and every language in AM has a polynomial time nondeterministic algorithm in the uniform average-case se...
متن کاملHardness as randomness: a survey of universal derandomization
We survey recent developments in the study of probabilistic complexity classes. While the evidence seems to support the conjecture that probabilism can be deterministically simulated with relatively low overhead, i.e., that P = BPP , it also indicates that this may be a difficult question to resolve. In fact, proving that probalistic algorithms have non-trivial deterministic simulations is basi...
متن کاملHardness vs. Randomness within Alternating Time
We study the complexity of building pseudorandom generators (PRGs) with logarithmic seed length from hard functions. We show that, starting from a function f : {0, 1} → {0, 1} that is mildly hard on average, i.e. every circuit of size 2 fails to compute f on at least a 1/poly(l) fraction of inputs, we can build a PRG : {0, 1} n) → {0, 1} computable in ATIME (O(1), log n) = alternating time O(lo...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 2001
ISSN: 0022-0000
DOI: 10.1006/jcss.2001.1780